Random Networks with Quantum Boolean Functions

We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous networks. This model is based on the previously developed concept of functions. A network a where functions associated with nodes are study some properties this novel and, using simulator, we how dynamics change in function connectivity and set operators allow. For configurations, resembles behavior while for other configurations more complex dynamic emerge. example, cycles larger than 2N were observed. Additionally, scheme akin to one used random computed average entropy complexity As opposed classic “complex” restricted mainly close phase transition, networks exhibit stable, complex, unstable independently their connectivity.